568A - Primes or Palindromes - CodeForces Solution

#include <bits/stdc++.h>
#include <string>

using namespace std;

int main() {
    int p, q, prime = 0, palindrome = 0, maxExists = -1;

    cin >> p >> q;

    for (int i = 1; i <= 1200000; i++) {
        string palCheck = to_string(i);

        if (i > 1) {
            bool is = true;
            for (int j = 2; j * j <= i; j++) {
                if (i % j == 0)
                    is = false;
            }
            if (is)
                prime++;
        }

        int n = palCheck.size();
        bool isPal = true;

        for (int z = 0; z < palCheck.size(); z++) {
            if (palCheck[n - z - 1] != palCheck[z])
                isPal = false;
        }

        if (isPal)
            palindrome++;

        if (prime * q <= palindrome * p) {
            maxExists = i;
        }
    }

    if (maxExists == -1)
        cout << "Palindromic tree is better than splay tree";
    else
        cout << maxExists;

    return 0;
}